Species Minimization in Computation with Biochemical Reactions
نویسندگان
چکیده
Engineering biochemical reactions for computational purposes is a common pursue in synthetic biology [1]. In such design tasks, molecular species have to be carefully engineered to ensure modularity and orthogonality [3, 7], and are scarce resources. Minimizing the number of involved molecular species is crucial to accomplish a complex computation within a confined biochemical environment. This report aims at species minimization by reusing modular and regular reactions in an asynchronous time-multiplexed fashion. Our method enhances not only species utility, but also re-programmability and robustness in realizing various logic circuits. A case study demonstrates the ease of design in realizing general logic computation, and simulation confirms the feasibility and robustness of the proposed method. The quest for deciphering nature’s design principle of living organisms has been the primary subject in systems biology. This goal cannot be fully achieved unless human engineers can construct complex biological systems from scratch. A synthetic approach to biology aims to create complex systems bottom up from elementary components [1]. In such construction, a convenient way of modeling biological systems is from a computational aspect regarding system states in terms of molecular concentrations. Despite the intrinsic hybrid nature (involving both continuous and discrete state evolutions) of a biological system, the dominating digital design methodology of electronic circuits can be systematically carried to designing computation with biochemical reactions [2, 5]. Building upon our prior work [2], we address a fundamental limitation of biological circuit design. Unlike electronic circuit design, where a logic gate can be freely instantiated into several copies to compose a complex logic function, in a biological circuit every signal corresponds to a distinct molecular species, and every instantiation of a logic gate “consumes” molecular species. As molecular species have to be carefully engineered to ensure modularity and orthogonality for proper operation [3, 7], they are expensive resources. It raises an important question, how to minimize molecular species involved in achieving a target computational task.
منابع مشابه
Thermodynamic Analysis of Light Olefins Production via Cracking of n-Hexane Using Gibbs Energy Minimization Approach and Analysis of Overall Reactions
Thermodynamic analysis of the cracking of hexane has been conducted by the Gibbs free energy minimization method and second law analysis of overall reactions. By-products have been divided into three groups of methane, alkynes and aromatics and their possible production paths have been discussed. Effect of operating conditions such as temperature and steam-to-hexane ratio on the cracking perfor...
متن کاملسینتیک تشویه پنتا اکسید وانادیم با کربنات سدیم
Vanadium is distributed widely and scarcely (150 ppm) on the earth. Its major applications are in steelmaking, dye-production and catalyst-fabrication industries. With the ever-increasing demand for this metal, secondary resource-exploitation of such waste materials as spent catalysts is recommended. Many reactions are involved in vanadium-extraction from these resources. Since roasting in comp...
متن کاملAutomatic analysis of computation in biochemical reactions
We propose a modeling and analysis method for biochemical reactions based on finite state automata. This is a completely different approach compared to traditional modeling of reactions by differential equations. Our method aims to explore the algebraic structure behind chemical reactions using automatically generated coordinate systems. In this paper we briefly summarize the underlying mathema...
متن کاملA Projected Alternating Least square Approach for Computation of Nonnegative Matrix Factorization
Nonnegative matrix factorization (NMF) is a common method in data mining that have been used in different applications as a dimension reduction, classification or clustering method. Methods in alternating least square (ALS) approach usually used to solve this non-convex minimization problem. At each step of ALS algorithms two convex least square problems should be solved, which causes high com...
متن کاملWriting and Compiling Code into Biochemistry
This paper presents a methodology for translating iterative arithmetic computation, specified as high-level programming constructs, into biochemical reactions. From an input/output specification, we generate biochemical reactions that produce output quantities of proteins as a function of input quantities performing operations such as addition, subtraction, and scalar multiplication. Iterative ...
متن کامل